An optimal algorithm for rectangle placement
نویسندگان
چکیده
In this paper we consider the problem of placing eeciently a rectangle in a two-dimensional layout that may not have the bottom-left placement property. This problem arises when we apply any one of a number of iterative improvement algorithms to the cutting stock problem or its variants. Chazelle has given an O(n)-time placement algorithm when the layout has the bottom-left property; we extend this result to the more general situation by presenting a (n log n)-time algorithm.
منابع مشابه
Optimal Placement and Sizing of TCSC & SVC for Improvement Power System Operation using Crow Search Algorithm
Abstract: The need for more efficient power systems has prompted the use of a new technologies includes Flexible AC transmission system (FACTS) devices. FACTS devices provides new opportunity for controlling the line power flow and minimizing losses while maintaining the bus voltages within a permissible limit. In this thesis a new method is proposed for optimal placement and sizing of Thyristo...
متن کاملOptimal Placement and Sizing of Distributed Generation Via an Improved Nondominated Sorting Genetic Algorithm II
The use of distributed generation units in distribution networks has attracted the attention of network managers due to its great benefits. In this research, the location and determination of the capacity of distributed generation (DG) units for different purposes has been studied simultaneously. The multi-objective functions in the optimization model are reducing system line losses; reducing v...
متن کاملA graph search algorithm: Optimal placement of passive harmonic filters in a power system
The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملOptimal Recloser Placement by Binary Differential Evolutionary Algorithm to Improve Reliability of Distribution System
In this context, a novel structure has been proposed for simple Differential Evolutionary (DE) algorithm to solve optimal recloser placement. For this, an operator is added to DE algorithm to adapt concept of the problem. Other contribution of this work is formulating a novel objective function. The proposed objective function has been formulated to improve four reliability indices which consis...
متن کاملOptimal Recloser Placement by Binary Differential Evolutionary Algorithm to Improve Reliability of Distribution System
In this context, a novel structure has been proposed for simple Differential Evolutionary (DE) algorithm to solve optimal recloser placement. For this, an operator is added to DE algorithm to adapt concept of the problem. Other contribution of this work is formulating a novel objective function. The proposed objective function has been formulated to improve four reliability indices which consis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 24 شماره
صفحات -
تاریخ انتشار 1999